Accelerated Schemes for the $L_1/L_2$ Minimization
نویسندگان
چکیده
منابع مشابه
Accelerated Bend Minimization
We present an O(n) algorithm for minimizing the number of bends in an orthogonal drawing of a plane graph. It has been posed as a long standing open problem at Graph Drawing 2003, whether the bound of O(n7/4√logn) shown by Garg and Tamassia in 1996 could be improved. To answer this question, we show how to solve the uncapacitated min-cost flow problem on a planar bidirected graph with bounded c...
متن کاملAdaptive Restart for Accelerated Gradient Schemes
In this paper we demonstrate a simple heuristic adaptive restart technique that can dramatically improve the convergence rate of accelerated gradient schemes. The analysis of the technique relies on the observation that these schemes exhibit two modes of behavior depending on how much momentum is applied. In what we refer to as the ‘high momentum’ regime the iterates generated by an accelerated...
متن کاملIterative Minimization Schemes for Solving the Single Source Localization Problem
We consider the problem of locating a single radiating source from several noisy measurements using a maximum likelihood (ML) criteria. The resulting optimization problem is nonconvex and nonsmooth and thus finding its global solution is in principal a hard task. Exploiting the special structure of the objective function, we introduce and analyze two iterative schemes for solving this problem. ...
متن کاملAccelerated Proximal Stochastic Dual Coordinate Ascent for Regularized Loss Minimization
We introduce a proximal version of the stochastic dual coordinate ascent method and show how to accelerate the method using an inner-outer iteration procedure. We analyze the runtime of the framework and obtain rates that improve state-of-the-art results for various key machine learning optimization problems including SVM, logistic regression, ridge regression, Lasso, and multiclass SVM. Experi...
متن کاملAccelerated Bregman Method for Linearly Constrained ℓ1-ℓ2 Minimization
We consider the linearly constrained `1-`2 minimization and propose the accelerated Bregman method for solving this minimization problem. The proposed method is based on the extrapolation technique, which is used in accelerated proximal gradient methods studied by Nesterov, Nemirovski, and others, and the equivalence between the Bregman method and the augmented Lagrangian method. O( 1 k2 ) conv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2020
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2020.2985298